FEASIBLE FLOWS IN MULTICOMMODITYGRAPHSbyHolly
نویسندگان
چکیده
This thesis establishes the minimal representation of the necessary conditions for feasible supplies and demands for a given multicom-modity network. The fundamental theorem is an extension of the Wallace-Wets connectivity result for both directed and undirected graphs. A system of absolute value inequalities is developed for the undirected case, and special properties of this system are explored. Additional results include counting the number of nonredundant inequalities for speciic classes of graphs. This abstract accurately represents the content of the candidate's thesis. I recommend its publication.
منابع مشابه
ROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH
This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملExtreme point characterizations for infinite network flow problems
We study capacitated network flow problems with demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models includes, for example, all infinite horizon deterministic dynamic programs with finite action sets, because these are equivalent to the problem of finding a shortest path in an infinite directed network. We derive necessary and suffi...
متن کاملTradeoffs Associated with Sediment-maintenance Flushing Flows: a Simulation Approach to Exploring Non-inferior Options
Sediment-maintenance flushing flows designed to mimic the action of natural floods in removing the accumulated fine sediments from the channel and loosening the gravel bed have been increasingly proposed as an effective alternative in dam management and a required component of riverine restoration programmes. However, reservoir releases are generally associated with financial and environmental ...
متن کاملA typing theory for flow networks (part I)
A flow network N is a capacited finite directed graph, with multiple sources (or input arcs in the paper) and multiple sinks (or output arcs). A flow f inN is feasible if it satisfies the usual flow-conservation condition at every node and lower-bound/upper-bound capacity constraints at every arc. We develop an algebraic theory of feasible flows in such networks with several beneficial conseque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995